翻訳と辞書 |
Range minimum query : ウィキペディア英語版 | Range minimum query
In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science such as the lowest common ancestor problem or the longest common prefix problem (LCP). == Definition ==
Given an array of objects taken from a well-ordered set (such as numbers), the range minimum query (with ) returns the position of the minimal element in the specified sub-array . For example, when , then the answer to the range minimum query for the sub-array is , as .
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Range minimum query」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|